Assignment and scheduling in parallel matrix factorization
نویسندگان
چکیده
منابع مشابه
Concurrent Locomotive Assignment and Freight Train Scheduling
The locomotive assignment and the freight train scheduling are important problems in railway transportation. Freight cars are coupled to form a freight rake. The freight rake becomes a train when a locomotive is coupled to it. The locomotive assignment problem assigns locomotives to a set of freight rakes in a way that, with minimum locomotive deadheading time, rake coupling delay and locomotiv...
متن کاملDue-date assignment and parallel-machine scheduling with deteriorating jobs
In this paper we study the problem of scheduling n deteriorating jobs on m identical parallel machines. Each job’s processing time is a nondecreasing function of its start time. The problem is to determine an optimal combination of the due-date and schedule so as to minimize the sum of the due-date, earliness and tardiness penalties. We show that this problem is NP-hard, and we present a heuris...
متن کاملCommunication-Optimal Parallel 2.5D Matrix Multiplication and LU Factorization Algorithms
Extra memory allows parallel matrix multiplication to be done with asymptotically less communication than Cannon’s algorithm and be faster in practice. “3D” algorithms arrange the p processors in a 3D array, and store redundant copies of the matrices on each of p layers. ‘2D” algorithms such as Cannon’s algorithm store a single copy of the matrices on a 2D array of processors. We generalize the...
متن کاملMatrix Factorization and Matrix Concentration
Matrix Factorization and Matrix Concentration by Lester Wayne Mackey II Doctor of Philosophy in Electrical Engineering and Computer Sciences with the Designated Emphasis in Communication, Computation, and Statistics University of California, Berkeley Professor Michael I. Jordan, Chair Motivated by the constrained factorization problems of sparse principal components analysis (PCA) for gene expr...
متن کاملComparing Nested Dissection Orderings for Parallel Sparse Matrix Factorization
In this paper we compare nested dissection orderings obtained by diierent graph bisection heuristics. In the context of parallel sparse matrix factorization the quality of an ordering is not only determined by its ll reducing capability, but also depends on the dif-culty with which a balanced mapping of the load onto the processors of the parallel computer can be found. Our analysis shows that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1986
ISSN: 0024-3795
DOI: 10.1016/0024-3795(86)90172-2